A Global Constraint for Parallelizing the Execution of Task Sets
نویسنده
چکیده
We introduce the track parallelization problem (TPP) that consists in parallelizing the execution of task sets. For modelling and solving TPPs in a finite-domain constraintprogramming framework, we propose the TPP constraint along with a suitable solver for use in non-preemptive scheduling. We demonstrate how to infer redundant TPPs in school timetabling and we report a large-scale empirical study that has been performed to investigate the effects of TPP propagation in this domain of application.
منابع مشابه
A Global Constraint for Parallelizing the Execution of Task Sets in Non-Preemptive Scheduling
In this paper, we introduce tracks. A track is a global constraint for parallelizing the execution of task sets in non-preemptive scheduling. We give algorithms for bound as well as for domain reasoning, we propose applications in school timetabling, and we report results of a large-scale empirical study. Section 2 introduces concepts and notations we rely on. Section 3 defines tracks in terms ...
متن کاملAutomatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming
Abs t r ac t . Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence det...
متن کاملParallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002